An Update Procedure for A Probabilistic Deductive Database
نویسنده
چکیده
A sound and complete view update procedure for a probabilistic deductive database is formulated using SLDp derivation trees introduced by Ng and Subrahmanian in 8]. In order to reduce the number of valid translations that can satisfy an update request a preference criteria is proposed. Moreover, we introduce a method called-factor to minimize the change eeected by updates in the database.
منابع مشابه
Probabilistic diagnosis as an update problem
Incompleteness is addressed by using a framework that allows expression of probability. An update procedure is given to handle nonmonotonic change of knowledge. We point out the relationship between probabilistic diagnosis and probabilistic deductive database updates, and present a coincidence theorem which formally establishes it. An implication of the result allows us to treat diagnostic prob...
متن کاملAn Approach to the Synthesis of Update Transactions in Deductive Databases*
We propose a new method for generating consistency-preserving transaction programs for (view) updates in deductive databases. The method augments the deductive database schema with a set of transition and internal events rules, which explicitly define the database dynamic behaviour in front of a database update. At transaction-design-time, a formal procedure can use these rules to automatically...
متن کاملA formal Method for the Synthesis of Update Transactions in Deductive Databases without Existential Rules
We propose a new method for generating consistency-preserving transaction programs for (view-)updates in deductive databases. The method augments the deductive database schema with a set of transition and internal events rules, which explicitly define the database dynamic behaviour in front of a database update. At transaction-design-time, a formal procedure can use these rules to automatically...
متن کاملFormalising Existential Rule Treatment in the Automatic Synthesis of Update Transactions in Deductive Databases*
We propose a new method for generating consistency-preserving transaction programs for (view) updates in deductive databases. The method augments the deductive database schema with a set of transition and internal events rules, which explicitly define the database dynamic behaviour in front of a database update. At transaction-design-time, a formal procedure can use these rules to automatically...
متن کاملView Updates in Disjunctive Deductive Databases Based on SLD-Resolution
View update problem in deductive databases is concerned with the translation of an update of an intensional relation by modifying the underlying relations of the extensional part of the database. In the existing algorithms for view updates of a deductive database, a sound and complete proof procedure is usually employed to generate explanations for the atom to be inserted or deleted. In the cas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996